Fixed Point Iteration Chaos Controlled ZCDPLL
نویسندگان
چکیده
منابع مشابه
Fixed Point Iteration Method
We discuss the problem of finding approximate solutions of the equation 0 ) ( x f (1) In some cases it is possible to find the exact roots of the equation (1) for example when ) (x f is a quadratic on cubic polynomial otherwise, in general, is interested in finding approximate solutions using some numerical methods. Here, we will discuss a method called fixed point iteration method and a part...
متن کاملFixed Point Iteration with Inexact Function Values
In many iterative schemes, the precision of each step depends on the computational effort spent on that step. A method of specifying a suitable amount of computation at each step is described. The approach is adaptive and aimed at minimizing the overall computational cost subject to attaining a final iterate that satisfies a suitable error criterion. General and particular cost functions are co...
متن کاملFixed Point Iteration on Pointsymmetric Interference Graphs
Interference graphs are used for performance analysis of multiprocessor interconnection networks. In order to model blocked transmissions, nodes can have three states: idle, active or blocked. The resulting steady state probability distribution has a non-product form. Macro states are introduced to calculate performance measures, and the corresponding macro state probability distribution is app...
متن کاملSolving time-fractional chemical engineering equations by modified variational iteration method as fixed point iteration method
The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...
متن کاملA fixed point iteration for computing the matrix logarithm
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical method calculates successive square roots. In this article, a new algorithm is presented that relies on the computation of successive matrix exponentials. Conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Communications, Network and System Sciences
سال: 2016
ISSN: 1913-3715,1913-3723
DOI: 10.4236/ijcns.2016.911042